class KthLargest {//leetcode703——数据流中的第k大的元素
public:
    KthLargest(int k, vector<int>& nums) {
        _k=k;
        for(auto x:nums)
        {
            heap.push(x);
            if(heap.size()>_k) heap.pop();
        }
    }
    
    int add(int val) {
        heap.push(val);
        if(heap.size()>_k) heap.pop(); 
        return heap.top();
    }
private:
    priority_queue<int,vector<int>,greater<int>> heap;
    int _k=0;
};